1205A - Almost Equal - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
 
#define ll long long
 
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
 
 
ll Count_digit(ll N)
{
    ll Count = 0;
    while(N > 0)
    {
        Count++;
        N = N / 10;
    }
    return Count;
}
 
 
int Mod(ll N)
{
    return N % 1000000007;
}
bool isprime(ll N)
{
    if(N == 1)
        return false;
    for(ll i = 2; i*i <= N; i++)
        if(N % i == 0)
            return false;
    return true;
}
bool cmp(ll a, ll b)
{
    return a>b;
}
ll power(ll a,ll b)
{
    ll temp=1;
    while(b--)
        temp*=a;
    return temp;
}

ll stringToInt(const string &s)
{
    stringstream om(s);
    ll num=-1;
    om>>num;
    return num;
}

string intToString(ll n)
{
    ostringstream ostr;
    ostr<<n;
    return ostr.str();
}

void PrintVf(vector<ll> Arr)
{
    for(int i = 0; i < Arr.size(); i++)
        cout <<Arr[i] <<" ";
    cout << endl;
}


void PrintVb(vector<ll> Arr)
{
    for(int i = Arr.size() - 1; i >= 0; i--)
        cout <<Arr[i] <<" ";
    cout << endl;
}

ll binpow(ll a, ll b)
{
    ll res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}
 
void solve()
{
    ll N;
    cin >> N;
    if(N % 2 == 0)
        NO
    else
    {
        YES
        for(int i = 0; i < N; i++)
        {
            if(i % 2 == 0)
                cout << 2 * i + 1 << " ";
            else
                cout << 2 * i + 2 << " ";
        }
        for(int i = 0; i < N; i++)
        {
            if(i % 2 == 0)
                cout << 2 * i + 2 << " ";
            else
                cout << 2 * i + 1 << " ";
        }
    }
    cout << endl;


}
 
 
int main()
{
 
    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}